Methods and systems for reducing burst usage of a networked computer system

ABSTRACT

Methods and systems for reducing burst usage of a networked computer system are described herein. In an embodiment, resource requesters can request, within a time window, resources over a computer network before the resources are available. The resources can then be allocated in batch mode when the resources are available. Thus, resource requests do not have to be processed in real-time, and resource requests can be received before the resources are available.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation-in-part of U.S. Ser. No. 14/843,594,filed Sep. 2, 2015, (now U.S. Pat. No. 9,363,142 issued on Jun. 7,2016), which is a continuation of U.S. Ser. No. 13/462,277, filed on May2, 2012, which is a divisional of U.S. Ser. No. 11/703,525, filed onFeb. 7, 2007, which claims the priority benefit of U.S. ProvisionalPatent Application No. 60/771,113, filed on Feb. 7, 2006, thedisclosures of each of which are hereby incorporated by reference intheir entirety for all purposes. This application is also acontinuation-in-part of U.S. Ser. No. 14/250,167, filed Apr. 10, 2014,which is a divisional of U.S. Ser. No. 11/502,344, filed on Aug. 10,2006, which is a continuation of U.S. Ser. No. 11/059,990, filed on Feb.17, 2005, which is a continuation-in-part of U.S. Ser. No. 09/778,606,filed on Feb. 7, 2001, which is a continuation-in-part of U.S. Ser. No.09/586,927, filed on Jun. 5, 2000, which is a continuation ofInternational Patent Application No. PCT/US00/03136, filed on Feb. 7,2000, which is a continuation-in-part of U.S. Ser. No. 08/862,547, filedon May 23, 1997, which claims the priority benefit of U.S. ProvisionalPatent Application No. 60/018,211, filed on May 23, 1996, thedisclosures of each of which are hereby incorporated by reference intheir entirety for all purposes.

COPYRIGHT NOTICE

A portion of the disclosure of this patent document contains materialthat is subject to copyright protection. The copyright owner has noobjection to the facsimile reproduction by any one of the patentdocument or the patent disclosure, as it appears in the Patent andTrademark Office patent file or records, but otherwise reserves allcopyright rights whatsoever.

BACKGROUND OF THE INVENTION

Field of the Invention

The present invention relates to methods and systems for allocatingresources via a network, and in particular, to methods and systems forreducing peak usage of a networked computer system.

Description of the Related Art

Networked computer systems tend to be designed to handle peak loads,such as those that may be encountered during prime hours, to avoidsystem crashes and overly lengthy response times. However, having anetworked computer system configured to handle peak or burst loads oftenrequires expensive infrastructure, and may result in certain systemresources, such as processors, memory, and/or network bandwidth, beingunderutilized for significant periods of time.

SUMMARY OF THE INVENTION

The present invention relates to methods and systems for allocatingresources via a network, and in particular, to methods and systems forreducing peak usage of a networked computer system.

An example embodiment provides a method of reducing burst usage in anetworked computer system, the method comprising: transmitting over anetwork to a plurality of computers information regarding a future firsttime period when resource requests for a first set of resources will beaccepted, wherein resources in the first set of resources are notallocated during the first time period; receiving a plurality ofresource requests from a plurality of requesters during the first periodof time, wherein the plurality of resource requests are received overthe network, wherein the plurality of resource requests include arequest from a first of the resource requesters for a preferred resourceand an indication as to whether an alternate resource different than thepreferred resource would be acceptable; during a second time periodbeginning after the first time period ends, processing the plurality ofresource requests in batch mode using a processing system, theprocessing further comprising: ranking the plurality of resourcerequests based on one or more of the following criteria: correspondinglocations for some or all of the resource requesters; history ofresource requests for some or all of the resource requesters; allocatingresources to at least a portion of the plurality requesters based atleast in part on corresponding resource request rankings andavailability of requested resources; transmitting a communication overthe network to one or more requesters receiving an allocation, thecommunication providing information regarding the correspondingallocation; allocating the alternate resource to the first requester ifthe first requester indicated a willingness to accept the alternateresource, was not allocated the preferred resource, and if the alternateresource is available to be allocated to the first requester; andtransmitting a communication over the network regarding the alternateresource allocation to the first requester.

Another example embodiment provides a method of allocating resources inbatch mode via a computer system, the method comprising: transmittingover a network to a plurality of terminals information regarding afuture first time period when resource requests for a first set ofresources will be accepted but will not be allocated; receiving aplurality of resource requests over the network from a plurality ofrequesters during the first period of time; ranking the plurality ofresource requests based on one or more of the following criteria:location of one or more resource requesters; historical transactionfrequency of one or more resource requesters; quantity of previousresource allocations to one or more resource requesters; historicaltransaction value of resource allocations to one or more resourcerequesters; information related to reallocation of resources by one ormore resource requesters to others; a quantity of resources currentlybeing requested by one or more resource requesters; whether a number ofresources currently being requested by one or more resource requestersis an odd or even number of resources; preferred membership status ofone or more resource requesters; during a second period of time,allocating resources using a processing system to at least a portion ofthe plurality requesters based at least in part on correspondingresource request rankings; and transmitting a communication over thenetwork to at least one requester allocated a requested resource, thecommunication including a notification regarding the requested resourceallocation.

Another example embodiment provides a method of performing delayedallocations of tickets via a computer system, the method comprising:transmitting over a network to a first terminal associated with a userinformation regarding a first time period when ticket requests for afirst event will be accepted, wherein a ticket for the first eventprovides one or more people with event access; receiving a firstplurality of ticket requests over the network from a first plurality ofusers during the first period of time; processing the first plurality ofticket requests using a processing system during a second time period,wherein the second time period begins after the first plurality ofticket requests has been received; ranking the first plurality of ticketrequests based on one or more of the following criteria: a location ofone or more users requesting tickets; historical transaction frequencywith respect to ticket purchases of one or more users requestingtickets; quantity of previous tickets purchased by one or more usersrequesting tickets; value of ticket purchases made by one or more usersrequesting tickets; information related to a resale of tickets by one ormore users requesting tickets; the quantity of event seating currentlybeing requested by one or more users requesting tickets; whether one ormore users is requesting an odd number of event seats; preferredmembership status of one or more users requesting tickets; allocatingtickets to at least a portion of the plurality users based at least inpart on corresponding ticket request rankings; and transmitting acommunication to one or more users allocated a requested ticket.

An example embodiment provides a method of performing allocations oftickets via a computer system, the method comprising: receiving a firstplurality of ticket requests over the network from a first plurality ofusers during the first period of time; ranking the first plurality ofticket requests based on one or more of the following criteria: alocation of one or more users requesting tickets; historical transactionfrequency with respect to ticket purchases of one or more usersrequesting tickets; quantity of previous tickets purchased by one ormore users requesting tickets; value of ticket purchases made by one ormore users requesting tickets; information related to a resale oftickets by one or more users requesting tickets; allocating tickets toat least a portion of the plurality users based at least in part oncorresponding ticket request rankings; and transmitting a communicationto one or more users allocated a requested ticket.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the present invention will now be described withreference to the drawings summarized below. These drawings and theassociated description are provided to illustrate example embodiments ofthe invention, and not to limit the scope of the invention.

FIG. 1, including FIGS. 1A-B, illustrates an example system embodimentthat can be used in conjunction with the processes described herein.

FIG. 2 illustrates an example resource allocation process, includingbatch allocation.

FIG. 3 illustrates an example resource allocation batch process.

FIG. 4 illustrates an example resource preference user interface.

FIG. 5 illustrates an example delivery specification user interface.

FIG. 6 a log in user interface.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

The present invention relates to methods and systems for allocatingresources via a network, and in particular, is related to methods andsystems for reducing peak usage of a networked computer system.

As will be described in greater detail below, an online system acceptsresource order submissions over a network during a window of time andthen closes that window. Rather than assigning resources (e.g.,inventory, such as event tickets) to orders in real time, resourcerequests are made prior to resource availability, and resources are thenoptionally assigned in a batch mode. Thus, in an example embodiment, apresale can be conducted, wherein users submit purchase requests, andoptionally users are not assured or guaranteed they will receive therequested inventory until the allocation process has been performed.

By way of illustrative example, after the submission window has closed,inventory is selectively assigned to orders submitted within the windowbased on one or more criteria. For example, inventory assignment can bebased on (i) a random allocation of inventory to requesting users, (ii)allocating inventory based on a user's transaction frequency and/oramount (e.g., based on how often the user purchases inventory, theamount of inventory the user has purchased in the past, the total dollarvalue of inventory purchased by the user, and/or based on how recentlythe user purchased inventory, etc.) (iii) low amount of tickets ordered(e.g., allocating inventory based on how an infrequent a user the useris), (iv) past resale activity by user (e.g., how recently and/or howoften the user has resold inventory previously purchased, such as thatoriginally sold, then resold and tracked via a ticket system), (v) theprice offered by the user for the inventory (for an example ofallocation based on price offered by the user, see U.S. Ser. No.14/250,167, filed Apr. 10, 2014, the disclosure of which is herebyincorporated by reference in its entirety for all purposes), (vi) seatlocation preferences, where the inventory is related to seats (e.g.,seats at a concert, sporting event, an airplane, etc.), (vii) the amountof inventory the user is currently requesting (e.g., how many seattickets), (viii) whether the user is currently requesting an odd or aneven amount of inventory, (ix) whether the user has indicated that theuser is willing to accept alternate inventory (e.g., tickets for otherevent performances); (x) how to increase or maximize total inventorysales (e.g., how to reduce the number of empty seats for an event usingseat packing); (xi) whether the user has a preferred membership (e.g.,which may be obtained by paying a fee or by being subscriber of aselected other service, such as of a certain credit or charge cardservice); (xii) event timing preferences (for an example of allocationbased on event timing preferences, see U.S. Ser. No. 14/250,167, filedApr. 10, 2014, the disclosure of which is hereby incorporated byreference in its entirety for all purposes); and/or (xiii) othercriteria.

Optionally, the allocation of inventory to order submissions within thesubmission (e.g., presale) window is not based on the date or timing ofthe submission within that window (e.g., allocations are optionally notmade on a first come first serve basis). This enables humans andmachines to better compete for inventory fairly, rather than solely onhow quickly users submitted purchase requests within the submissionwindow. Optionally, the allocation process described herein providesdemand information to help determine whether to acquire or createadditional inventory or whether to adjust inventory pricing.

The processes and systems described herein can provide an enhancedtechnique for allocating inventory (e.g., tickets), that is in highdemand to accomplish certain distribution, allocation, and/or pricinggoals. In addition, utilization of the processes and systems describedherein can reduce the needed ticket system infrastructure by reducingburst loads on the system.

Throughout the following description, the term “Web site” is used torefer to a user-accessible server site that implements the basic WorldWide Web standards for the coding and transmission of hypertextualdocuments. These standards currently include HTML (the Hypertext MarkupLanguage), which can be used to generate Web pages, and HTTP (theHypertext Transfer Protocol). It should be understood that the term“site” or “computer system” are not intended to imply a singlegeographic location, as a Web or other network site can, for example,include multiple geographically-distributed computer systems that areappropriately linked together. Furthermore, while the followingdescription relates to an embodiment utilizing the Internet and relatedprotocols, other networks, such as networked interactive televisions andwireless phones, and other protocols, may be used as well.

In addition, unless otherwise indicated, the functions described hereinmay be performed by software modules including executable code andinstructions running on one or more general-purpose computers. Thecomputers can include one or more central processing units (CPUs) thatexecute program code and process data, memory, including one or more ofvolatile memory, such as random access memory (RAM) for temporarilystoring data and data structures during program execution, non-volatilememory, such as a hard disc drive, optical drive, or FLASH drive, forstoring programs and data, including databases, which may be referred toas a “system database,” and a wired and/or wireless network interfacefor accessing an intranet and/or Internet.

In addition, the computers can include a display for displaying userinterfaces, data, and the like, and one or more user input devices, suchas a keyboard, mouse, pointing device, microphone and/or the like, usedto navigate, provide commands, enter information, provide searchqueries, and/or the like. However, the systems described herein can alsobe implemented using special purpose computers, terminals, statemachines, and/or hardwired electronic circuits.

Further, the example processes described herein do not necessarily haveto be performed in the described sequence, and not all states have to bereached or performed. In addition, certain process states that areillustrated or described as being serially performed herein, can beperformed in parallel.

While the following discussion may often relate to tickets (e.g., avoucher to indicate that one has paid for or is entitled to admission toa theatre, concert, amusement park, zoo, aquarium, museum, concert, orother attraction, or entitled to travel on an airplane, public transit,train, or other mode of transportation) in order to illustrate the useand application of the disclosed systems and methods, the disclosedsystems and methods can be applied to other types of units, inventory,or finite resources, such as products or other priority rights.

A significant problem posed with respect to the allocation of finiteresources via a networked computer based system, where the demand isgreater than the supply, is that large numbers of users will oftenattempt to access, within a relatively brief amount of time, thecomputer system allocating the finite resource. Often, this results inpeak or burst loads on the allocating computer system and network thatexceed the available bandwidth of the allocating computer system and/ornetwork. This can result in bottlenecks and user access blockages.

Conventionally, in order to accommodate such peak and burst loads, theallocating computer system operator needs to configure the computersystem (e.g., via additional servers, higher speed intranets, etc.) tohandle peak loads that are often far in excess of the typical load.Similarly, the operator may need to lease or acquire higher speed oradditional network lines in order to handle the peak load, as will needto lease or acquire the corresponding hardware (modems, switches,routers, etc.) to interface to the network lines. The foregoing approachresults in higher system acquisition, lease and maintenance costs.

A nonlimiting example of a finite resource that may be allocated via anonline computer system are event tickets. For example, the event ticketsmay be for a sporting event, a concert, a show, a movie, or for otherentertainment events at a given venue. By way of further example, thefinite resource may be for a plane ticket (e.g., a regular ticket or aticket acquired with frequent flier miles), or for a right to buy aproduct offered in limited amounts.

Thus, for example, if an online ticket system is selling tickets for ahighly popular event (e.g., the Super bowl, a Rolling Stones concert,opening day at an amusement park, etc.), at a large venue (e.g., seating60,000 people), or with many performances at a venue with relativelyfewer seats (e.g., a play having 100 scheduled performances at a venuewith 1500 seats), then as soon as the tickets are put on sale, theonline ticket system will often experience a burst of online usersattempting to purchase tickets via the agency website in a relativelyshort period of time. Such a burst load can overwhelm the ticket system,resulting in user access blockages.

An example online purchase process may include some or all of thefollowing acts: providing the user over a network (e.g., the Internet)an event selection form, receiving the user event selection via theform; providing the user with a ticket request form; receiving the userticket request criteria (e.g., number of tickets, price range, seatsection, etc.); verifying that the user request complies with ticketpurchase guidelines (e.g., does not exceed a specified maximum number oftickets); providing over the network a form used to better ensure thatan automated program (e.g., a software robot) is not being used topurchase the ticket (e.g., by presenting a word that the user needs totype into a field); verifying that the user correctly completed theform; determining what are the available seats that meet the user'scriteria; providing, over the network, the user with a listing of theseats being temporarily reserved for the user pending the user'spurchase; providing over the network a ticket delivery instruction form;receiving or the network user ticket delivery instructions; receivinguser registration information (e.g., name, contact information (such asstreet addresses, city, state, zip code, email address, phone number,instant messaging identifier, etc.) desired password, etc.) or accountlog in information (e.g., a password and/or a user identifier);receiving over the network payment information (e.g., credit card numberand expiration date); verifying the payment information, processing theissuance of the ordered tickets; and send a purchase confirmation to theuser (e.g., via a Web page, an email, and/or an SMS message). Inaddition, the online ticket system has to determine when a user hasabandoned a purchase process (e.g., by determining if the user failed tocomplete a purchase process step within a designated period of time),and then has to release tickets reserved for that user so that otherusers can purchase the tickets.

If the ticket system has to successfully perform that above process forthousands of users within a short period of time (e.g., within 15 or 30minutes), the ticket system will need an expensive backendinfrastructure and high bandwidth access to the Internet.

In one embodiment, in order to reduce the peak or burst loads on theticket system, and hence, to correspondingly optionally reduce theneeded ticket system bandwidth, rather than just taking purchaserequests for tickets when the tickets are actually available for sale, apresale process is provided. As will be discussed in greater detail,users can request tickets before the tickets actually go on sale. Oncethe tickets are put on sale, users can be randomly selected (e.g., thedate and time of the presale user ticket request during the presalewindow does not affect the quality or quantity of tickets they willallocated) by the ticket system to receive tickets that meet thecorresponding user ticket criteria and other criteria.

Optionally, the actual ticket allocation can be performed in a batchmode, and the timing of the allocation process can be selected so thatit is performed when the ticket system is not otherwise heavily loaded(e.g., between 2:00 AM and 3:00 AM). Hence, rather than allocating thebest ticket to the first user to request a ticket, the second bestticket to the second user to request a ticket, and so on, in a firstcome first serve manner, the order in which users made presale requestsfor a given set of tickets (e.g., tickets for a particular event orsection) will not correspond or not have a one-to-one correspondence tothe order in which tickets are allocated.

Because, for example, if a user who requests a ticket two weeks afterthe start of a presale has the same chance of being allocated a giventicket as a user who requests a ticket on the presale start date, therewill be significantly less motivation on the part of users to rush torequest tickets on the presale start date. Instead, online ticketrequests to the ticket system are likely to be more evenly distributedover the presale period, rather than be heavily front loaded during thestart of the sale. Hence, optionally, the ticket system infrastructurecan be comparatively reduced.

In addition, there will likely be less motivation for certain users touse automated programs to reserve seats, as there will not be a benefitto being an early ticket requester. Users may view the foregoingallocation process as being more fair, as users are not placed at adisadvantage just because they did not have access to a computer (torequest tickets) at the time the sale or presale began.

Optionally, when the actual sale starts, tickets that have not beenallocated to presale requesters (e.g., if the number of requestedtickets is less than the available number of tickets, or if some ticketswere not offered to presale requesters) can be sold on a first comefirst serve basis, or on other basis.

The following is an illustrative example process. A determination ismade as to when a presale should begin for a given event. The start andend of the presale period may be consistent for a given type of event.For example, if the event is a rock or pop concert, the presale periodmay typically be set to start four weeks (or other period of time) priorto the actual sale, and the presale ends immediately before the actualsale. By way of further example, if the event is a basketball game, thepresale period may typically be set to start three months (or otherperiod of time) prior to the actual sale, and the presale ends two weeksbefore the actual sale.

The period start may also be set, based at least in part, on historicalsales statistics for a given event type, a performer, a team, a calendarperiod, etc. For example, the historical sales information can beretrieved from a storage location, such as an historical salesinformation database. A formula or algorithm, stored as executable codein computer readable memory, can be used to automatically calculate thepresale start state relative to the actual sale start date, or a humancan make presale start date determination.

For example, if a concert for a performer sold out in one day for aprevious performance in a given city (indicating that there will be ahigh demand for tickets for the current event performance at issue),then the presale start date can be set to two months before the actualsale start day so that users will feel less pressure to quickly submitrequests. By way of further example, if a concert for a performer soldout in three months for a previous performance in a given city, then thepresale start date is set to one month before the actual sale start day,as it is less likely that there will be a large number of ticketrequests in a short period of time. Thus, optionally, the start date canbe dynamically determined based on historical sales patterns usinginformation stored in computer readable memory. The presale start timecan be selected based on other criteria as well.

Optionally, an initial presale end date may be extended up to the actualonsale date based on the number of submitted requests and/or the numberof tickets requested during at least a portion of the initial presalewindow. Optionally, even after an initial presale window has ended, anew presale window may be established, with a start date after the enddate of the initial presale window.

Optionally, all the available tickets are made available to presalerequesters. Optionally, instead, only a subset of available tickets ismade available to presale requesters. For example, a portion of seattickets may be reserved for purchasers who submit requests during theonsale, as opposed to the presale, period. Optionally, the number ofseats for which tickets are available during the presale is smaller thanthe number of seats for which tickets are available after the presale.Optionally, the number of seats for which tickets are available duringthe presale is larger than the number of seats for which tickets areavailable after the presale.

Optionally, a user may be permitted to cancel a presale request within aspecified time period. For example the cancellation period may extend tothe start of the actual sale, to a certain period of time after the usersubmitted the presale request, or a predetermined period of time beforethe actual sale starts. If the presale is setup so that a user cancancel a presale request, the user is informed of the cancellationguidelines and period via a presale Web page. Optionally, if the usercancels a request, the user is charged a fee as a result of thecancellation.

By way of example, users can be informed (e.g., via email, textmessaging, a Web page hosted by the ticket same, print advertisement,etc.) of an upcoming event and provided information regarding one ormore of the presale start date, the presale end date, the sale startdate or the sale end date.

Using a browser or other interface executing on a terminal (e.g., apersonal computer, a networked personal digital assistant, a networkedtelevision, a smart phone, etc.), a user can access a presale form via aticket system Web page. The user may access the presale Web page via alanding page that lists presale events, via a specific presale page thatlists presale events, by searching for the event via a search field, viaa link provided to the user in an email, or otherwise. Optionally, thepresale Web page can be provided online prior to the presale start date,with the page informing visitors of the presale start date, and withoutaccepting presale requests.

The presale Web page can provide ticket request guidelines or rules. Forexample, the guidelines can specify a maximum number of tickets that auser can request for a given event, whether the user has to request aneven number of tickets, etc. Optionally, the user may also be informedthat the user will be required to provide payment information which willbe used to pay for the tickets should the user be allocated tickets oncethe sale begins.

One or more fields may be provided via which the user can specify thenumber of tickets being requested, the price or price range of therequested tickets, and/or the desired seating section. Further, the usermay optionally request that the user be allocated the best availableseats. The user may optionally be provided with a field via which theuser indicates that the user is willing to accept seats at a differentcost or in a different location (e.g., a worse seating section).

The user may also be provided with an option of selecting one or morealternate related events (e.g., different performance dates for a play)in the event the user is not allocated tickets for the selected event.For example, three fields may be provided on the Web page, wherein theuser is asked to select: a most preferred alternate event performanceusing a first field (e.g., by selecting from a set of listedperformances displayed in a drop down or pop up menu); a second mostpreferred alternate event performance using a second field; a third mostpreferred alternate event performance using a third field. The user canoptionally specify no alternative event performances, or less than threealternate event performances. Optionally, the user may be required tospecify at least one alternate performance, if such is available.

The user selections are stored in a corresponding database which can beaccessed when performing the seat allocation. Optionally, a field can beprovided wherein the user can specify whether or not the user is willingto accept tickets for non-contiguous sets (e.g., seats spread out overmore than one row or section, or seats within a single row, but whereinthe seats are not contiguous).

Once the user has entered the requested information and selections, theuser can activate a “submit” button. Optionally, an optical barrier(e.g., a word verification page) or other device may be provided tobetter prevent automated programs from submitting requests. Automatedprograms are less likely to be able to read the presented word and enterthe word into the designated field.

Once the user enters the designated word into the field, the useractivates a “continue” button. The ticket system verifies that the wordwas entered correctly, and if so, a delivery page is transmitted to theuser terminal, the delivery Web page listing different delivery optionsand associated fees (if any). The user can select a desired deliverytype (e.g., email, via a Web page, 2.sup.nd day morning delivery,2.sup.nd day delivery, standard delivery, will call, etc.) by clickingon, or otherwise selecting the listed delivery type. Optionally, thesystem will calculate the total cost of the tickets, delivery fees,service fees, and the total of the foregoing, and will transmit the costand fee information to the user via the user terminal for presentationto the user. The user can activate a submit button, and a payment pageis presented to the user. The user may be asked to enter a credit cardnumber, expiration date, a credit card identifier (CIN).

The Web page may further include user registration fields in which theuser is to enter requested information, such as contact information(such as street addresses, city, state, zip code, email address, phonenumber, instant messaging identifier, etc.), user identifier, desiredpassword, etc., or account log in information (e.g., a password and/or auser identifier). Optionally, the user will be presented with anotheroptical barrier Web page.

Optionally, the ticket system checks to make sure a delivery type wasselected, verify the credit card number, expiration date, and CIN, anddetermine if the optical barrier entry from the user is correct. If anerror occurs with respect to the foregoing, the user is optionally askedto provide or correct the corresponding information. If the user failsto correct the errors or provides a cancel instruction (e.g., via acancel button, by not responding, by logging out, or otherwise), orotherwise does not complete the form, the user's request is optionallyrejected, and tickets will not be allocated based on the request.

Optionally, the user is not required to provide payment, paymentinformation and/or shipping information until after tickets have beenallocated to the user. Optionally, instead, the user is charged for therequested tickets even before the tickets have been allocated to theuser, and the charge is cancelled or the user is credited the chargedamount in the event the user is not allocated the requested tickets.

Once the presale period is closed for the tickets at issue, the ticketsystem does not accept additional presale ticket requests for thosetickets, unless a new presale window is established.

Once the tickets are available for allocation (e.g., once an actual saleperiod has started or other time period), the tickets can be allocatedusing a batch process. Optionally, the allocation process can beperformed when ticket system computers are lightly loaded (e.g., atnight, when access by users tends to be low) or upon the occurrence of aselected event. The batch processing may be performed, by way ofexample, immediately after the end of the presale, 1, 2, 6, 12, 24, 36,or other specified number of hours after the end of (or the beginningof) the presale, or other time period. Optionally, general tickets salesvia the ticket system website are restricted or not allowed, until thebatch process of allocating tickets to the presale requesters iscomplete. For example, the batch allocation process can be performedfrom 2:00 AM to 4:00 AM on a given day, and the general sale of ticketsto other users is later initiated at 8:00 AM that day.

As similarly discussed above, the allocation process to presalerequesters can be based on one or more criteria. For example, the ticketsystem is optionally programmed to allocate to a user requesting morethan one ticket, tickets for contiguous seats, to avoid the user's groupbeing split up among over multiple rows and/or sections. Hence, in orderto avoid empty seats that might result from an inability to fit a user'sgroup into the empty seats, the ticket system optionally allocatestickets, taking into account the number of tickets being requested foreach of several users, and assigns seats and allocates tickets so as tokeep groups together in contiguous seats, while also reducing orminimizing unfilled seats. For example, users requesting a smaller, evennumber of tickets (e.g., 2 tickets) are optionally allocated ticketsbefore users requesting a larger number of tickets (e.g., 3 or moretickets). By way of further example, users requesting an even number oftickets are optionally allocated tickets before those requesting an oddnumber of tickets.

By way of further example, preference may be given to requesting usersbased, at least in part, on their location or their distance from avenue or other designated area. For example, tickets may be allocated tousers based, at least in part, on their mailing and/or billing zipcodes, where users in a certain set of zip codes (e.g., zip codes forareas closer to the event venue) are allocated tickets before those inother zip codes. By way of further example, optionally, the best seatticket(s) can be allocated to the user that is closest to the eventvenue, the second best seat ticket(s) can be allocated to the user thatis the second closet to the event venue, and so on until either all theseats in the relevant set of seats are allocated, or until allrequesting users have been allocated tickets.

By way of still further example, tickets may be allocated based onwhether the user has purchased a ticket via the ticket system within acertain period of time. For example, in order to encourage ticketrequesters that have not recently utilized the ticket system to utilizethe ticket system with greater frequency, those users that have notordered and/or requested tickets via the ticket system within a selectedperiod of time (e.g., 6 months or 1 year), may be allocated ticketsbefore those users that have utilized the system more frequently. By wayof further example, optionally, the best seat ticket(s) can be allocatedto the user that that have never previously utilized the ticket service,the second best seat ticket(s) can be allocated to the user for whichthe most time has elapsed since the user previously utilized the ticketsystem, and so on until either all the seats in the relevant set ofseats are allocated, or until all requesting users have been allocatedtickets. Optionally, ties (e.g., two users that have the same elapsedtime since their last previous use), can be broken based on one or moreother criteria, such as the number of tickets requested, the users'locations, the frequency of a user's ticket purchases, one or more ofthe other criteria discussed herein, etc.

By way of yet further example, tickets may be allocated based on thefrequency with which a user has purchased tickets via the ticket system.For example, in order to reward frequent ticket purchaser, the greaterthe user ticket purchase frequency, the higher priority the user willhave in being allocated tickets. Optionally, ties (e.g., two users thathave the same elapsed time since their last previous use), can be brokenbased on one or more other criteria, such as the number of ticketsrequested, the users' locations, one or more of the other criteriadiscussed herein, etc.

By way of still further example, tickets may be allocated based on aranking of the requests made by the presale requesters. For example, arequest made during the onsale period may include data representing anamount for ticket(s) and a preference for a time an event may start. Insome examples, after the presale period ends, the tickets may be ranked,selected, and accordingly associated with requesters. For an example ofallocation based on ranking, see U.S. Ser. No. 14/250,167, filed Apr.10, 2014, the disclosure of which is hereby incorporated by reference inits entirety for all purposes.

By way of illustration, once the presale has closed (e.g., during thebatch processing), the user requests can be ranked or ordered based onone or more of the foregoing criteria. For example, the user requestscan first be ranked or ordered based on the quantity of seats beingrequested. For those user requests that are assigned the same ranking orposition in an ordering, those requests can be re-ranked or re-orderedbased on other criteria, such as the user location. Similarly, for thoseusers that have the same ranking or ordering after the first re-ranking,a further re-ranking or re-ordering can be performed based on stilladditional criteria (e.g., the frequency of ticket purchases), and soon. Thus, one, two, three, four, five, six or more criteria can be usedto rank and/or re-rank ticket requests.

Optionally, to the extent that certain requests still have the sameranking, a “tied” request can randomly or alphabetically (e.g., based onthe user last and/or first name) be assigned a higher or lower rankingrelative to another tied request so that each user request has a uniqueranking. Optionally, when there is a “tied” request, the user thatsubmitted the ticket request first is given a higher ranking. Tickets(associated with corresponding reserved seats if the event is not ageneral admission event) are then allocated to the users based at leastin part on the request rankings. For example, the highest ranked userrequest (e.g., for a given user specified price and/or section) can beassigned the best available (e.g., the estimated most preferred) seatswithin the price and/or section category specified by the user. The nexthighest ranked user request can be assigned the second best availableseats, etc. Thus, in addition to the user requests being ranked orordered, some or all of the venue seats are optionally ranked or orderedbased, at least in part, or the perceived to expected desirability ofthe seats. The seat ticket allocations are optionally therefore based onboth ticket request rankings or order, and seat rankings or order.

After the ticket assignments have been performed, the users assignedtickets can have their payment information verified to determine if it(e.g., a credit card or charge card) is still valid (e.g., by check withthe credit card issuer or agent). If a user's payment mechanism isdeclined or otherwise cannot be used, optionally, the user may beinformed of the problem and/or asked for an alternative paymentmechanism within a specified period of time. If the user fails to do so,the user is not allocated a ticket and the next higher ranked userrequest having matching seat criteria is allocated the seat tickets thathad previously been assigned to the user's whose payment mechanism hasbeen declined.

Optionally, instead, if a user's payment mechanism is declined orotherwise cannot be used, that user is not asked to provide analternative form of payment, and instead the user's request is removedfrom the queue without such a request. Then, as similarly discussedabove, a re-ranking is performed without the now removed user request(e.g., the next higher ranked user request having the same seatcriteria, such as the same number of seat tickets, at the same costlevel, is allocated the seat tickets that had previously been assignedto the user's whose payment mechanism has been declined). Further,rather than assigning the tickets to the next highest ranking matchinguser request, user requests can be re-ranked, and the allocation processcan be based on the re-ranking.

After a user's payment mechanism has been validated (or after a set ofusers have had their payment mechanisms validated), the user's paymentmechanism is charged for the tickets, as well as associated service anddelivery fees, the user is notified of the charge and/or the ticketallocation (e.g., the user is informed that the user has been allocateda ticket, the seats, if any, the user has been allocated, the ticketamount, related taxes and service fees, the total transaction cost,etc., via email, a Web page, an SMS message, an AIM (AOL® InstantMessenger) message, Apple iChat audio/video message, other instantmessage, or otherwise), and the ticket is delivered to the user inaccordance with the user's earlier instructions.

Example embodiments will now be discussed with reference to the figures.FIG. 1, including FIGS. 1A-B, illustrates an example embodiment that canbe used in conjunction with the processes described herein. Not all ofthe illustrated systems and components need to be included in theticketing system, and other systems and architectures can be used aswell. With reference to FIG. 1, a user terminal 102 is coupled to anexample ticket system 104 over the Internet 105 using HTTP/HTTPS orother protocol. An example web proxy system 106 includes an optionalload balancer 108 and web proxy processors 110, and can selectivelyblock or route an inbound request from a user browser executing on theterminal 102 to an appropriate internal destination, (e.g., a queue orother destination server).

The illustrated example ticket system 104 includes example Webapplication system 112, which includes an optional load balancer 114 andWeb application processors 116. A general transaction system 118includes an optional load balancer 120 and transaction processors 122that are used to generate transactional pages, populate data caches,provide logic and/or rules for the transaction flows, and to sequencerequests. A cache cluster system 124 includes an optional load balancer126 and processors 128. The cache cluster system 124 caches data andstates for quick access by other system components.

An example ticket processor system 130 is provided that includes anoptional load balancer 132 and processors 134. The example ticketprocessors 134 conduct and/or manage the event ticketing, perform batchprocessing of ticket requests, keep track of tickets being sold, thestatus of presales and sales, the current ticket requesters orpurchasers, the number of seat tickets being requested by correspondingticket requesters, the price, section, and/or location of the requestedseats, whether a given ticket requester is willing to accept tickets foran alternative performance, the requesting ticket delivery methods, thenumber of seats being offered during the presale and sale, ticketprices, and so on. A session cluster system 136 includes an optionalload balancer 138 and a plurality of processors 140 and is used tomanage sessions.

A member transaction repository database 142 stores user contactinformation, billing information, preferences, account status, and thelike, that can be accessed by other portions of the ticket system 104.The database 142 can also store a user opt-in for notificationsregarding tickets (e.g., whether the user was allocated a ticket duringthe batch allocation process).

An event database 144 stores information regarding events, including, byway of example, the venue, artist, date, time, additional performances,and the like. The event database 144 or a separate database includesticket information records, including one or more of barcodeinformation, event name, event date, seat identifier, ticket holder nameor other identifier of a current ticket holder, names or otheridentifiers of past holders of the ticket, a ticket valid/invalidindicator, and/or an indicator that as to whether the ticket has beenused. The database 144, or another database, can also store informationregarding a presale beginning date, a presale end date, an onsalebeginning date, an onsale end date, the maximum quantity of Units a usercan request or purchase, and so on.

An event database server 146 is used to provide event database access toother portions of the ticket system.

An example database 148 is provided that stores historical eventinformation (e.g., of events that have already taken place), such ashistorical information regarding events, optionally including the eventdate, the event type, the identity of the performer/team, the eventvenue, the event presale start date (if there was a presale), the eventpresale end date, information relating to the number of requesters perday for each day of the presale, the total number of tickets assigned topresale requesters, the total number of tickets made available topresale ticket requesters, the event onsale start date, the event onsaleend date, information relating to the number of ticket purchases per dayfor each day of the onsale, the total number of tickets sold during theonsale period, the total number of event tickets offered for sale duringthe onsale period, as well as other optional information. Optionally,some or all of the foregoing information can be used in setting presalestart and end dates for future events, as well as sale start and enddates.

A host network system 150 is also optionally provided.

FIG. 2 illustrates an example resource allocation process, includingbatch allocation. At state 202, historical information regardingprevious events is retrieved from a database. For example, informationregarding one or more events that have already occurred can beretrieved, including some or all of the following information: eventdate, event type (e.g., sports event, musical event, travel event,etc.), identity of the performer/team (if applicable), event venue,event presale start date (if there was a presale), event presale enddate, information relating to the number of requesters per day for eachday of the presale, total number of tickets assigned to presalerequesters, total number of tickets made available to presale ticketrequesters, event onsale start date, event onsale end date, informationrelating to the number of ticket purchases per day for each day of theonsale, total number of tickets sold during the onsale period, totalnumber of event tickets offered for sale during the onsale period, etc.Information can also include types of information disclosed in U.S.application Ser. No. 11/951,988, filed on Dec. 6, 2007 and/or U.S.Application No. 60/873,324, filed on Dec. 7, 2006, each of which ishereby incorporated by reference in its entirety for all purposes.

At state 204, some or all of the information retrieved at state 202 isused to automatically select a presale start date (which can be manuallymodified). At state 206, some or all of the information retrieved atstate 202 is used to automatically select a presale end date (which canbe manually modified). Optionally, instead, the presale end date can beset to end at, or about, the beginning of the onsale process.

At state 208, the presale begins. The system receives presale ticketrequests via online forms (e.g., accessed via user terminals), a kiosk,or other user interface (e.g., via a phone system, such as aninteractive voice response system or via a human in a call center), andstores the requests and related information in a database. Users may berequested to provide some or all of the following information: thenumber of tickets being requested, the price or price range of therequested tickets, the desired seating section (including “the bestavailable seats” as an option), acceptable alternate performances, andwhether the user is willing to accept tickets for non-contiguous seats.Because the tickets are not yet on sale, in some circumstances, theticket price may not have been finalized. Therefore, the user may beadvised that the final price of a ticket may be different than thatdisplayed by the system and requested to approve a ticket charge withina price range. For example, the user may be informed that a ticket pricewill have a final price within the range of $35-$42 and the user may beasked to provide acceptance for such ticket price range. The user'sacceptance or refusal is stored in memory.

The system optionally monitors the total number of requests at a givenpoint in time, the rate of requests, the number of seats beingrequested, and/or the time the requests are being submitted. At state210, which can be performed in parallel with state 208, a determinationis optionally made as to whether the presale start date should beextended or altered based on some or all of the monitored requestrelated information. For example, if ticket requests are being receivedat a slower than expected rate, the system can extend the presale enddate to enable more users to request tickets during the presale window.If a decision has been made to extend the end date, the process proceedsto state 212, and a new presale end date is set. The process theproceeds from state 212 to state 208, and additional presale ticketrequests are received.

The ticket presale ends at state 214. At state 216, batch processing isperformed on the ticket requests as described herein, and those usersthat are allocated tickets are charged, and the tickets are delivered.For example, the tickets can be downloaded over the network to the userterminal from the ticketing website and printed by the user; sent as anemail attachment or embedded in an email, transmitted to a mobile phone,stored in a smart card (e.g., a pocket size or substantially credit cardsized card that includes processor and can store certain information ina tamper-resistant manner), or otherwise provided. The tickets (whetherin a hardcopy form or stored electronically) can include scannablebarcode information and/or have human readable indicia indicating theevent name, event date/time, one or more seat numbers (e.g., for areserved seat event), a ticket recipient name, and/or other information.At state 218, the online sale begins for the now available tickets.Thus, users can now purchase tickets in substantially real time (asopposed to in a batch process) via the ticket system Web site, kiosks,or otherwise. Optionally, states 216 and 218 are performed at leastpartially in parallel, or are performed serially.

FIG. 3 illustrates an example resource request batch process. By way ofexample, the illustrated batch process can be performed at state 216,illustrated in FIG. 2. At state 302, user requests are retrieved from adatabase and ranked or ordered based on one or more criteria, such asthe example criteria discussed herein (user location, purchasehistories, membership in a preferred group or affiliate, etc.). At state304, a determination is made as to whether there are user requests thathave been given the same ranking. At state 306, user requests that havethe same ranking are optionally re-ranked or ordered based on additionalcriteria, such as one or more of the criteria discussed herein. At state308, seat tickets are allocated to users based on their associatedranking and the seat ranking (e.g., those users with better rankings areoptionally allocated seats with better rankings, as compared to userswith worse rankings).

At state 310, a verification is performed as to whether a given user'spayment vehicle can be used to pay for the ticket purchase (e.g., if thepayment vehicle is a credit card, a determination is optionally made asto whether the credit card code is valid, whether the credit card hasexpired, whether the credit card had its credit limit exceeded, and/orwhether the credit card charge has been denied).

At state 314, if the payment verification failed for a user, the user'sallocated seat tickets are allocated to another user. For example,optionally all the user requests can be re-ranked, and a re-allocationof seat tickets performed, without including the user whose paymentverification failed. Optionally, instead, only a portion of the userrequests (e.g., those with a lower ranking than the removed user) arere-ranked, and a re-allocation of seat tickets performed, withoutincluding the user whose payment verification failed. Users who wereallocated seats, and whose payment vehicles were verified, are chargedfor the allocated tickets and associated service and delivery fees. Atstate 316, the tickets are delivered to users in accordance with userinstructions retrieved from a database. Optionally, the payment vehicleverification is performed prior to state 302, so that user requests canbe removed prior to the initial ranking process if the verificationfailed.

FIG. 4 illustrates an example presale ticket request form, althoughforms having fewer, more, or different fields can be used as well. Theexample presale request form includes information regarding the eventfor which tickets are being requested. For example, theartist/performer/sports team name, the venue name, the venue location,and the event date are optionally presented. In addition, the ticketprices (or estimated price range) for available sections or seatingareas are presented. Some or all of the following fields are provided,via which the user can provide entries via a drop down menu, by typingvalues into the fields, or otherwise: a number of tickets field (whereinthe user can designate the number of seat tickets the user isrequesting), a price range field (wherein the user can designate theprice range of the seat tickets the user is requesting), a sectionfield, a location field, an alternative performance selectionperformance field (wherein the user can select an alternate performancedate or an alternate event, should the user not be allocated a ticketfor the event at issue), and/or an accept noncontiguous seats field(wherein the user can indicate that the user is willing to acceptnoncontiguous seat assignments). The selections and information providedby the user via the form is stored in a database in association with auser and/or session identifier. The information can later be retrievedby the system for ticket seat allocation.

FIG. 5 illustrates an example form used to select a ticket deliverymethod. For example, the user can optionally specify that the ticketsare to be delivered via email, via a Web page, via expedited delivery(e.g., overnight, two day, or Saturday delivery), or via will call(e.g., where the user picks up the tickets at the box office on the showdate). Optionally, a fee is charged for certain delivery methods. Theexample form illustrated in FIG. 4 presents the current total ticketcost, shipping cost, service and handling fee, and overall total costfor the tickets and delivery method requested by the user. The useroptionally can click on a “recalculate” button, and in response, thesystem may recalculate the foregoing costs and fees, and cause therecalculated costs and fees to be presented on the form or other userinterface.

FIG. 6 illustrates an example user log-in form which requests that theuser enter their first name, email address, zip code, and password. Theforegoing information can be used to access user account informationfrom a database and to store user ticket requests and other informationin the database in association with a user identifier.

Although this invention has been disclosed in the context of certainembodiments and examples, it will be understood by those skilled in theart that the present invention extends beyond the specifically disclosedembodiments to other alternative embodiments and/or uses of theinvention and obvious modifications and equivalents thereof. Inaddition, while a number of variations of the invention have been shownand described in detail, other modifications, which are within the scopeof this invention, will be readily apparent to those of skill in the artbased upon this disclosure. It is also contemplated that variouscombinations or subcombinations of the specific features and aspects ofthe embodiments may be made and still fall within the scope of theinvention. Accordingly, it should be understood that various featuresand aspects of the disclosed embodiments can be combined with, orsubstituted for one another in order to form varying modes of thedisclosed invention. Thus, it is intended that the scope of the presentinvention herein disclosed should not be limited by the particulardisclosed embodiments described above.

What is claimed is:
 1. A method of reducing burst usage in a networkedcomputer system, the method comprising: transmitting, over a network andto a plurality of computers, information regarding a first time periodwhen resource requests for a first set of resources will be accepted,wherein each resource in the first set of resources is not to beallocated during the first time period; receiving, over the network, aplurality of resource requests during the first time period, eachresource request of the plurality of resource requests being from arequester electronic device and being for at least a portion of theresources in the first set of resources; during a second time periodbeginning after the first time period ends, processing the plurality ofresource requests in batch mode using a processing system, theprocessing further comprising: assigning a priority to each resourcerequest of the plurality of resource requests, the assignment of thepriority being based on one or more criteria, and the assignment of thepriority not being dependent on a time at which each of the plurality ofresource requests was received; allocating first resources to a firstportion of a plurality of requesters based at least in part on theassigned priority and availability of requested resources, the pluralityof requesters corresponding to the plurality of requester electronicdevices; transmitting, for each requester in the first portion ofrequesters, a communication over the network to the correspondingrequester electronic device that provides information regarding a firstresource allocated to the requester; allocating one or more alternatesecond resources to a second portion of the plurality of requesters,each requester of the second portion of the plurality of requestershaving an assigned priority that is lower than each requester of thefirst portion of the plurality of requesters; and transmitting, for eachrequester in the second portion of requesters, a communication over thenetwork to the corresponding requester electronic device that providesinformation regarding an alternate second resource allocated to therequester.
 2. The method of reducing burst usage in a networked computersystem as recited in claim 1, further comprising: selecting the secondperiod based at least in part on an anticipated utilization level of theprocessing system.
 3. The method of reducing burst usage in a networkedcomputer system as recited in claim 1, further comprising: determining,based on a number of requests received during the first time period,that an end of the first time period is to be extended; and receiving,over the network, a second plurality of resource requests during a timeperiod between an initial end of the first time period and an extendedend of the first time period, wherein assigning the priority includesranking the plurality of resource requests and the second plurality ofresource requests.
 4. The method of reducing burst usage in a networkedcomputer system as recited in claim 1, wherein each of the firstresources is associated with a first date and each of the one or morealternate second resources is associated with a second date.
 5. Themethod of reducing burst usage in a networked computer system as recitedin claim 1, wherein the plurality of resource requests includes arequest from a requester that includes time data indicating that eitherof a first time for a first resource or a second time for the firstresource is acceptable, and that the first time is of a higher prioritythan the second time, and wherein assigning the priority includesranking the plurality of resource requests based on the time dataincluded in the request.
 6. The method of reducing burst usage in anetworked computer system as recited in claim 1, wherein the assignedpriority is based at least in part on historical resource requestfrequency information associated with each of at least some of theplurality of requesters.
 7. The method of reducing burst usage in anetworked computer system as recited in claim 6, wherein: when firsthistorical resource request frequency information corresponding to afirst requester is equal to second historical resource request frequencyinformation corresponding to a second requester, the assignment of thepriority includes: identifying a first geographical location associatedwith the first requester, identifying a second geographical locationassociated with the second requester, determining that the firstgeographical location is in closer proximity to a defined location thanthe second geographical location, and in response to the determinationthat the first geographical location is in closer proximity to thedefined location, assigning a higher priority to the first requesterthan to the second requester.
 8. A system for reducing burst usage in anetworked computer system, the system comprising: a computing device;non-transitory media with instructions stored thereon, which whenexecuted by the computing device cause the computing device to performoperations including: transmitting, over a network and to a plurality ofcomputers, information regarding a first time period when resourcerequests for a first set of resources will be accepted, wherein eachresource in the first set of resources is not to be allocated during thefirst time period; receiving, over the network, a plurality of resourcerequests during the first time period, each resource request of theplurality of resource requests being from a requester electronic deviceand being for at least a portion of the resources in the first set ofresources; during a second time period beginning after the first timeperiod ends, processing the plurality of resource requests in batch modeusing a processing system, the processing further comprising: assigninga priority to each resource request of the plurality of resourcerequests, the assignment of the priority being based on one or morecriteria, and the assignment of the priority not being dependent on atime at which each of the plurality of resource requests was received;allocating first resources to a first portion of a plurality ofrequesters based at least in part on the assigned priority andavailability of requested resources, the plurality of requesterscorresponding to the plurality of requester electronic devices;transmitting, for each requester in the first portion of requesters, acommunication over the network to the corresponding requester electronicdevice that provides information regarding a first resource allocated tothe requester; allocating one or more alternate second resources to asecond portion of the plurality of requesters, each requester of thesecond portion of the plurality of requesters having an assignedpriority that is lower than each requester of the first portion of theplurality of requesters; and transmitting, for each requester in thesecond portion of requesters, a communication over the network to thecorresponding requester electronic device that provides informationregarding an alternate second resource allocated to the requester. 9.The system of reducing burst usage in a networked computer system asrecited in claim 8, wherein the actions further include: selecting thesecond period based at least in part on an anticipated utilization levelof the processing system.
 10. The system of reducing burst usage in anetworked computer system as recited in claim 8, wherein the actionsfurther include: determining, based on a number of requests receivedduring the first time period, that an end of the first time period is tobe extended; and receiving, over the network, a second plurality ofresource requests during a time period between an initial end of thefirst time period and an extended end of the first time period, whereinassigning the priority includes ranking the plurality of resourcerequests and the second plurality of resource requests.
 11. The systemof reducing burst usage in a networked computer system as recited inclaim 8, wherein each of the first resources is associated with a firstdate and each of the one or more alternate second resources isassociated with a second date.
 12. The system of reducing burst usage ina networked computer system as recited in claim 8, wherein the pluralityof resource requests includes a request from a requester that includestime data indicating that either of a first time for a first resource ora second time for the first resource is acceptable, and that the firsttime is of a higher priority than the second time, and wherein assigningthe priority includes ranking the plurality of resource requests basedon the time data included in the request.
 13. The system of reducingburst usage in a networked computer system as recited in claim 8,wherein the assigned priority is based at least in part on historicalresource request frequency information associated with each of at leastsome of the plurality of requesters.
 14. The system of reducing burstusage in a networked computer system as recited in claim 13, wherein:when first historical resource request frequency informationcorresponding to a first requester is equal to second historicalresource request frequency information corresponding to a secondrequester, the assignment of the priority includes: identifying a firstgeographical location associated with the first requester, identifying asecond geographical location associated with the second requester,determining that the first geographical location is in closer proximityto a defined location than the second geographical location, and inresponse to the determination that the first geographical location is incloser proximity to the defined location, assigning a higher priority tothe first requester than to the second requester.
 15. A computer-programproduct tangibly embodied in a non-transitory machine-readable storagemedium, including instructions configured to cause one or more dataprocessors to perform actions including: transmitting, over a networkand to a plurality of computers, information regarding a first timeperiod when resource requests for a first set of resources will beaccepted, wherein each resource in the first set of resources is not tobe allocated during the first time period; receiving, over the network,a plurality of resource requests during the first time period, eachresource request of the plurality of resource requests being from arequester electronic device and being for at least a portion of theresources in the first set of resources; during a second time periodbeginning after the first time period ends, processing the plurality ofresource requests in batch mode using a processing system, theprocessing further comprising: assigning a priority to each resourcerequest of the plurality of resource requests, the assignment of thepriority being based on one or more criteria, and the assignment of thepriority not being dependent on a time at which each of the plurality ofresource requests was received; allocating first resources to a firstportion of a plurality of requesters based at least in part on theassigned priority and availability of requested resources, the pluralityof requesters corresponding to the plurality of requester electronicdevices; transmitting, for each requester in the first portion ofrequesters, a communication over the network to the correspondingrequester electronic device that provides information regarding a firstresource allocated to the requester; allocating one or more alternatesecond resources to a second portion of the plurality of requesters,each requester of the second portion of the plurality of requestershaving an assigned priority that is lower than each requester of thefirst portion of the plurality of requesters; transmitting, for eachrequester in the second portion of requesters, a communication over thenetwork to the corresponding requester electronic device that providesinformation regarding an alternate second resource allocated to therequester.
 16. The computer-program product as recited in claim 15,wherein the actions further include: selecting the second period basedat least in part on an anticipated utilization level of the processingsystem.
 17. The computer-program product as recited in claim 15, whereinthe actions further include: determining, based on a number of requestsreceived during the first time period, that an end of the first timeperiod is to be extended; and receiving, over the network, a secondplurality of resource requests during a time period between an initialend of the first time period and an extended end of the first timeperiod, wherein assigning the priority includes ranking the plurality ofresource requests and the second plurality of resource requests.
 18. Thecomputer-program product as recited in claim 15, wherein each of thefirst resources is associated with a first date and each of the one ormore alternate second resources is associated with a second date. 19.The computer-program product as recited in claim 15, wherein theplurality of resource requests includes a request from a requester thatincludes time data indicating that either of a first time for a firstresource or a second time for the first resource is acceptable, and thatthe first time is of a higher priority than the second time, and whereinassigning the priority includes ranking the plurality of resourcerequests based on the time data.
 20. The computer-program product asrecited in claim 15, wherein the assigned priority is based at least inpart on historical resource request frequency information associatedwith each of at least some of the plurality of requesters.